Small Longest Tandem Scattered Subsequences
نویسندگان
چکیده
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies longest subsequence which occurs twice without overlap in This is based on Hunt-Szymanski algorithm, therefore its performance improves if string not self similar, naturally strings over large alphabets. relies new results for data structures that support dynamic increasing sub-sequences. In process we also obtain improved algorithms decremental comparison problem.
منابع مشابه
Longest Common Subsequences
The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to thèedit distance', or number of mu-tations/errors/editing steps required in passing from one string to the other. In this talk, we explore some of the combinatorial properties of the sub-and super-sequence relations, survey various algorit...
متن کاملLongest subsequences in permutations
For a class of permutations X the LXS problem is to identify in a given permutation σ of length n its longest subsequence that is isomorphic to a permutation of X . In general LXS is NP-hard. A general construction that produces polynomial time algorithms for many classes X is given. More efficient algorithms are given when X is defined by avoiding some set of permutations of length 3.
متن کاملLongest Alternating Subsequences of Permutations
The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group Sn has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w, where a sequence a, b, c, d, . . . is alternating if a > b < c > d < · · · . For instance, the expected value (mean) of as(w) for w ∈ Sn is exactly (4n + 1)/6...
متن کاملEnumerating Longest Increasing Subsequences and Patience Sorting Enumerating Longest Increasing Subsequences and Patience Sorting
In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1; : : : ; n. The third problem is to en...
متن کاملHydrodynamical methods for analyzing longest increasing subsequences
Let Ln be the length of the longest increasing subsequence of a random permutation of the numbers 1, . . . , n, for the uniform distribution on the set of permutations. We discuss the “hydrodynamical approach” to the analysis of the limit behavior, which probably started with Hammersley (1972), and was subsequently further developed by several authors. We also give two proofs of an exact (non-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Annals of Computer Science
سال: 2021
ISSN: ['1843-8121', '2248-2695']
DOI: https://doi.org/10.7561/sacs.2021.1.79